Online Load Balancing of Temporary Tasks

This paper considers the non-preemptive on-line load balancing problem where tasks have limited duration in time. Upon arrival, each task has to be immediately assigned to one of the machines, increasing the load on this machine for the duration of the task by an amount that depends on both the machine and the task. The goal is to minimize the maximum load. Azar, Broder and Karlin studied the unknown duration case where the duration of a task is not known upon its arrival 4]. They focused on the special case in which for each task there is a subset of machines capable of executing it, and the increase in load due to assigning the task to one of these machines depends only on the task and not on the machine. For this case, they showed an O(n 2=3)-competitive algorithm, and an (p n) lower bound on the competitive ratio, where n is the number of the machines. This paper closes the gap by giving an O(p n)-competitive algorithm. In addition, trying to overcome the (p n) lower bound for the case of unknown task duration, this paper initiates a study of the load balancing problem for tasks with known duration (i.e., the duration of a task becomes known upon its arrival). For this case we show an O(log nT)-competitive algorithm, where T is the ratio of the maximum possible duration of a task to the minimum possible duration of a task. Preliminary version of this paper was presented at the 1993 Workshop on Algorithms and Data Structures. This paper merges the results of a paper by the rst, third and fth authors and a paper by the second and the forth authors. The paper explores an alternative way to overcome the (p n) bound; it considers the related machines case with unknown task duration. In the related machines case, a task can be executed by any machine and the increase in load depends on the speed of the machine and the weight of the task. For this case the paper gives a 20-competitive algorithm and show a lower bound of 3 ? o(1) on the competitive ratio.